Local Spin Susceptibility of the S=1/2 Kagome Lattice in ZnCu3(OD)6Cl2

We report single-crystal 2-D NMR investigation of the nearly ideal spin S=1/2 kagome lattice ZnCu3(OD)6Cl2. We successfully identify 2-D NMR signals originating from the nearest-neighbors of Cu2+ defects occupying Zn sites. From the 2-D Knight shift measurements, we demonstrate that weakly interacting Cu2+ spins at these defects cause the large Curie-Weiss enhancement toward T=0 commonly observed in the bulk susceptibility data. We estimate the intrinsic spin susceptibility of the kagome planes by subtracting defect contributions, and explore several scenarios.Comment: 4 figures; published in PR-B Rapid Communication

Supersymmetric QCD flavor changing top quark decay

We present a detailed and complete calculation of the gluino and scalar quarks contribution to the flavour-changing top quark decay into a charm quark and a photon, gluon, or a Z boson within the minimal supersymmetric standard model including flavour changing gluino-quarks-scalar quarks couplings in the right-handed sector. We compare the results with the ones presented in an earlier paper where we considered flavour changing couplings only in the left-handed sector. We show that these new couplings have important consequences leading to a large enhancement when the mixing of the scalar partners of the left- and right-handed top quark is included. Furthermore CP violation in the flavour changing top quark decay will occur when a SUSY phase is taken into account.Comment: 14 pages, latex, 3 figure

Data-driven linear decision rule approach for distributionally robust optimization of on-line signal control

We propose a two-stage, on-line signal control strategy for dynamic networks using a linear decision rule (LDR) approach and a distributionally robust optimization (DRO) technique. The first (off-line) stage formulates a LDR that maps real-time traffic data to optimal signal control policies. A DRO problem is solved to optimize the on-line performance of the LDR in the presence of uncertainties associated with the observed traffic states and ambiguity in their underlying distribution functions. We employ a data-driven calibration of the uncertainty set, which takes into account historical traffic data. The second (on-line) stage implements a very efficient linear decision rule whose performance is guaranteed by the off-line computation. We test the proposed signal control procedure in a simulation environment that is informed by actual traffic data obtained in Glasgow, and demonstrate its full potential in on-line operation and deployability on realistic networks, as well as its effectiveness in improving traffic

A bi-level model of dynamic traffic signal control with continuum approximation

This paper proposes a bi-level model for traffic network signal control, which is formulated as a dynamic Stackelberg game and solved as a mathematical program with equilibrium constraints (MPEC). The lower-level problem is a dynamic user equilibrium (DUE) with embedded dynamic network loading (DNL) sub-problem based on the LWR model (Lighthill and Whitham, 1955; Richards, 1956). The upper-level decision variables are (time-varying) signal green splits with the objective of minimizing network-wide travel cost. Unlike most existing literature which mainly use an on-and-off (binary) representation of the signal controls, we employ a continuum signal model recently proposed and analyzed in Han et al. (2014), which aims at describing and predicting the aggregate behavior that exists at signalized intersections without relying on distinct signal phases. Advantages of this continuum signal model include fewer integer variables, less restrictive constraints on the time steps, and higher decision resolution. It simplifies the modeling representation of large-scale urban traffic networks with the benefit of improved computational efficiency in simulation or optimization. We present, for the LWR-based DNL model that explicitly captures vehicle spillback, an in-depth study on the implementation of the continuum signal model, as its approximation accuracy depends on a number of factors and may deteriorate greatly under certain conditions. The proposed MPEC is solved on two test networks with three metaheuristic methods. Parallel computing is employed to significantly accelerate the solution procedure

The Electronic States of Two Oppositely doped Mott Insulators Bilayers

We study the effect of Coulomb interaction between two oppositely doped low-dimensional tJ model systems. We exactly show that, in the one-dimensional case, an arbitrarily weak interaction leads to the formation of charge neutral electron-hole pairs. We then use two different mean-field theories to address the two-dimensional case, where inter-layer excitons also form and condense. We propose that this results in new features which have no analog in single layers, such as the emergence of an insulating spin liquid phase. Our simple bilayer model might have relevance to the physics of doped Mott insulator interfaces and of the new four layer Ba2CaCu4O8 compound.Comment: 4 pages, 1 figur

Parallel processing architecture for computing inverse differential kinematic equations of the PUMA arm

In advanced robot control problems, on-line computation of inverse Jacobian solution is frequently required. Parallel processing architecture is an effective way to reduce computation time. A parallel processing architecture is developed for the inverse Jacobian (inverse differential kinematic equation) of the PUMA arm. The proposed pipeline/parallel algorithm can be inplemented on an IC chip using systolic linear arrays. This implementation requires 27 processing cells and 25 time units. Computation time is thus significantly reduced

Improving the security of secure direct communication based on secret transmitting order of particles

We analyzed the security of the secure direct communication protocol based on secret transmitting order of particles recently proposed by Zhu, Xia, Fan, and Zhang [Phys. Rev. A 73, 022338 (2006)], and found that this scheme is insecure if an eavesdropper, say Eve, wants to steal the secret message with Trojan horse attack strategies. The vital loophole in this scheme is that the two authorized users check the security of their quantum channel only once. Eve can insert another spy photon, an invisible photon or a delay one in each photon which the sender Alice sends to the receiver Bob, and capture the spy photon when it returns from Bob to Alice. After the authorized users check the security, Eve can obtain the secret message according to the information about the transmitting order published by Bob. Finally, we present a possible improvement of this protocol.Comment: 4 pages, no figur